Parametric Tilings and Scattered Data Approximation
نویسنده
چکیده
Abstract: This paper is concerned with methods for mapping meshes in IR to meshes in IR in such a way that the local geometry of the mesh is as far as possible preserved. Two linear methods are analyzed and compared. The first, which is more general and more stable, is based on convex combinations while the second is based on minimizing weighted squared lengths of edges. These methods can be used to approximate scattered data points in IR with smooth parametric spline surfaces.
منابع مشابه
Scattered data approximation of fully fuzzy data by quasi-interpolation
Fuzzy quasi-interpolations help to reduce the complexity of solving a linear system of equations compared with fuzzy interpolations. Almost all fuzzy quasi-interpolations are focused on the form of $widetilde{f}^{*}:mathbb{R}rightarrow F(mathbb{R})$ or $widetilde{f}^{*}:F(mathbb{R})rightarrow mathbb{R}$. In this paper, we intend to offer a novel fuzzy radial basis function by the concept of so...
متن کاملAPPROXIMATION OF 3D-PARAMETRIC FUNCTIONS BY BICUBIC B-SPLINE FUNCTIONS
In this paper we propose a method to approximate a parametric 3 D-function by bicubic B-spline functions
متن کاملIntersplines: A New Approach to Globally Optimal Multivariate Splines Using Interval Analysis
In science and engineering there often is a need for the approximation of scattered multi-dimensional data. A class of powerful scattered data approximators are the multivariate simplex B-splines. Multivariate simplex B-splines consist of Bernstein basis polynomials that are defined on a geometrical structure called a triangulation. Multivariate simplex B-splines have a number of advantages ove...
متن کاملConstruction of animation models out of captured data
This article describes a method to construct parametric models out of captured motion and skeleton data. Casting the problem as scattered data interpolation, our work is based on a multi-step approximation for the interpolation function with motion data compressed by principal component analysis. This leads into smaller storage and faster computation than those of previous approaches based on c...
متن کاملAlternative Tilings for the Fast Multipole Method on the Plane
The fast multipole method (FMM) performs fast approximate kernel summation to a specified tolerance ǫ by using a hierarchical division of the domain, which groups source and receiver points into regions that satisfy local separation and the well-separated pair decomposition properties. While square tilings and quadtrees are commonly used in 2D, we investigate alternative tilings and associated ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- International Journal of Shape Modeling
دوره 4 شماره
صفحات -
تاریخ انتشار 1998